Electrophysiological Brain Source Imaging via Combinatorial Search with Provable Optimality

نویسندگان

چکیده

Electrophysiological Source Imaging (ESI) refers to reconstructing the underlying brain source activation from non-invasive Electroencephalography (EEG) and Magnetoencephalography (MEG) measurements on scalp. Estimating locations their extents is a fundamental tool in clinical neuroscience applications. However, estimation challenging because of ill-posedness high coherence leadfield matrix as well noise EEG/MEG data. In this work, we proposed combinatorial search framework address ESI problem with provable optimality guarantee. Specifically, by exploiting graph neighborhood information space, converted into designed algorithm under A* solve it. The guaranteed give an optimal solution problem. Experimental results both synthetic data real epilepsy EEG demonstrated that could faithfully reconstruct brain.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Similarity Search via Combinatorial Nets

We consider Nearest Neighbor Search problem in the so called combinatorial framework: Only direct comparisons between two pairwise similarity values are allowed. We assume that the similarity order for the input dataset has the following consistency property: if x is the a’th most similar object to y and y is the b’th most similar object to z, then x is among the D(a + b) most similar objects t...

متن کامل

Electrophysiological brain activity and memory source monitoring.

To investigate brain mechanisms involved in identifying the origin of memories, event-related potentials (ERPs) were recorded as participants discriminated previously presented (old) from new items or identified their earlier source (picture, word, or new). Differences in ERPs between old-new recognition and source identification, were focused at frontal sites. For source identification, promin...

متن کامل

ARA*: Anytime A* with Provable Bounds on Sub-Optimality

In real world planning problems, time for deliberation is often limited. Anytime planners are well suited for these problems: they find a feasible solution quickly and then continually work on improving it until time runs out. In this paper we propose an anytime heuristic search, ARA*, which tunes its performance bound based on available search time. It starts by finding a suboptimal solution q...

متن کامل

Gapped Local Similarity Search with Provable Guarantees

We present a program qhash, based on q-gram filtration and high-dimensional search, to find gapped local similarities between two sequences. Our approach differs from past q-gram-based approaches in two main aspects. Our filtration step uses algorithms for a sparse all-pairs problem, while past studies use suffix-tree-like structures and counters. Our program works in sequence-sequence mode, wh...

متن کامل

Search-Based Planning with Provable Suboptimality Bounds

Search-based planning is widely used for mobile robot motion planning because of its guarantees of optimality and completeness. In continuous state-spaces, however, most existing approaches have significant limitations in terms of optimality and completeness because of the underlying grid used. We propose an approach that eliminates the dependency on grids by using more general equivalence clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i10.26471